Fast Longest Prefix Matching by Exploiting SIMD Instructions
نویسندگان
چکیده
منابع مشابه
Fast longest prefix matching: algorithms, analysis, and applications
Many current problems demand efficient best matching algorithms. Network devices alone show several applications. They need to determine a longest matching prefix for packet routing or establishment of virtual circuits. In integrated services packet networks, packets need to be classified by trying to find the most specific match from a large number of patterns, each possibly containing wildcar...
متن کاملDiss . ETH No . 13266 Fast Longest Prefix Matching
Many current problems demand efficient best matching algorithms. Network devices alone show several applications. They need to determine a longest matching prefix for packet routing or establishment of virtual circuits. In integrated services packet networks, packets need to be classified by trying to find the most specific match from a large number of patterns, each possibly containing wildcar...
متن کاملFast Sorted-Set Intersection using SIMD Instructions
In this paper, we focus on sorted-set intersection which is an important part in many algorithms, e.g., RID-list intersection, inverted indexes, and others. In contrast to traditional scalar sorted-set intersection algorithms that try to reduce the number of comparisons, we propose a parallel algorithm that relies on speculative execution of comparisons. In general, our algorithm requires more ...
متن کاملFast Parallel String Prefix-Matching
An O(log log m) time n log m log logm-processor CRCW-PRAM algorithm for the string preex-matching problem over a general alphabet is presented. The algorithm can also be used to compute the KMP failure function in O(log log m) time on m log m loglog m processors. These results improve on the running time of the best previous algorithm for both problems, which was O(log m), while preserving the ...
متن کاملA Fast Order-Preserving Matching with q-neighborhood Filtration Using SIMD Instructions
The order-preserving matching problem is a variant of the pattern matching problem focusing on shapes of sequences instead of values of sequences. Given a text and a pattern, the problem is to output all positions where the pattern and a subsequence in the text are of the same relative order. Chhabra and Tarhio proposed a fast algorithm based on filtration for the order-preserving matching prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3023156